<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    343. Integer Break
   </h1>
   <p>
    Given a positive integer
    <i>
     n
    </i>
    , break it into the sum of
    <b>
     at least
    </b>
    two positive integers and maximize the product of those integers. Return the maximum product you can get.
   </p>
   <p>
    <strong>
     Example 1:
    </strong>
   </p>
   <div>
    <pre>
<strong>Input: </strong><span id="example-input-1-1">2</span>
<strong>Output: </strong><span id="example-output-1">1</span>
<strong>Explanation: </strong>2 = 1 + 1, 1 &times; 1 = 1.</pre>
    <div>
     <p>
      <strong>
       Example 2:
      </strong>
     </p>
     <pre>
<strong>Input: </strong><span id="example-input-2-1">10</span>
<strong>Output: </strong><span id="example-output-2">36</span>
<strong>Explanation: </strong>10 = 3 + 3 + 4, 3 &times;&nbsp;3 &times;&nbsp;4 = 36.</pre>
     <p>
      <b>
       Note
      </b>
      : You may assume that
      <i>
       n
      </i>
      is not less than 2 and not larger than 58.
     </p>
    </div>
   </div>
  </div>
  <div>
   <h1 class="question_title">
    343. 整数拆分
   </h1>
   <p>
    给定一个正整数&nbsp;
    <em>
     n
    </em>
    ，将其拆分为
    <strong>
     至少
    </strong>
    两个正整数的和，并使这些整数的乘积最大化。 返回你可以获得的最大乘积。
   </p>
   <p>
    <strong>
     示例 1:
    </strong>
   </p>
   <pre><strong>输入: </strong>2
<strong>输出: </strong>1
<strong>解释: </strong>2 = 1 + 1, 1 &times; 1 = 1。</pre>
   <p>
    <strong>
     示例&nbsp;2:
    </strong>
   </p>
   <pre><strong>输入: </strong>10
<strong>输出: </strong>36
<strong>解释: </strong>10 = 3 + 3 + 4, 3 &times;&nbsp;3 &times;&nbsp;4 = 36。</pre>
   <p>
    <strong>
     说明:
    </strong>
    你可以假设&nbsp;
    <em>
     n&nbsp;
    </em>
    不小于 2 且不大于 58。
   </p>
  </div>
 </body>
</html>